Computing Minimum Diameter Color-Spanning Sets
نویسندگان
چکیده
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial time for L1 and L∞ metrics, while it is NP-hard for all other Lp metrics even in two dimensions. However, we can efficiently compute a constant factor approximation.
منابع مشابه
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
Given a set of n points P in the plane, each colored with one of the t given colors, a color-spanning set S ⊂ P is a subset of t points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum (among all color-spanning sets of P ). Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whos...
متن کاملReferências Bibliográficas
[1] Abdalla, A. M. Computing a diameter-constrained minimum spanning tree. Computational methods for the diameter restricted minimum weight spanning tree problem. create time-to-target plots.mon, G. MALLBA: A software library to design efficient optimisation algorithms .
متن کاملColor Spanning Annulus: Square, Rectangle and Equilateral Triangle
In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points P = {p1, p2, . . . , pn} in IR, where each point is assigned with a color in {1, 2, . . . , k}. We present algorithms for finding a minimum width color-spanning axis parallel square annulus (CSSA), minimum width color spanning axis parallel rectangular annulus (CSRA), and minimum w...
متن کاملA Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
The diameter of a tree is the largest number of edges on any path between two vertices in it. Given a weighted, connected, undirected graph G and a bound D ≥ 2, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of minimum weight whose diameter does not exceed D. An evolutionary algorithm for this NP-hard problem encodes candidate trees as permutations of their vertic...
متن کاملReload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کامل